Beyond Relational Databases: Preserving the Data
نویسندگان
چکیده
منابع مشابه
Relational databases and beyond
Database systems provide the engines for GIS. In the database approach, the computer acts as a facilitator of data storage and sharing. It also allows the data to be modified and analysed while in the store. For a computer system to be an effective data store, it must have the confidence of its users. Data owners and depositors must have confidence that the data will not be used in unauthorised...
متن کاملPrivacy-Preserving Queries over Relational Databases
We explore how Private Information Retrieval (PIR) can help users keep their sensitive information from being leaked in an SQL query. We show how to retrieve data from a relational database with PIR by hiding sensitive constants contained in the predicates of a query. Experimental results and microbenchmarking tests show our approach incurs reasonable storage overhead for the added privacy bene...
متن کاملPreserving and Querying Histories of XML-Published Relational Databases
There is much current interest in publishing and viewing database-resident data as XML documents. In fact, such XML views of the database can be easily visualized on web browsers and processed by web languages, including powerful query languages such as XQuery. As the database is updated, its external XML view also evolves. In this paper, we investigate the problem of representing the evolution...
متن کاملPreserving Multi-relational Outsourced Databases Confidentiality using Fragmentation and Encryption
Confidentiality and privacy of outsourced data has become one of the pressing challenges in Cloud computing. Outsourced data often includes sensitive personally identifiable information. When data is outsourced, sensitive information will not be under the control of its owners, but under the control of an external service provider. In this paper, we define an approach allowing the protection of...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Review of Information Networking
سال: 2020
ISSN: 1361-4576,1740-7869
DOI: 10.1080/13614576.2021.1919398